Using Local Spectral Methods to Robustify Graph-Based Learning Algorithms David F. Gleich Computer Science Department Purdue University West Lafayette, IN

Source URL: www.stat.berkeley.edu

• Graph theory
• Mathematics
• NP-complete problems
• Graph partition
• Connectivity
• Graph coloring
• Graph
• Nonlinear dimensionality reduction
• Vertex
• SPQR tree
• Signed graph

SECOND-ORDER MARKOV RANDOM FIELDS FOR INDEPENDENT SETS ON THE INFINITE CAYLEY TREE By David A. Goldberg Georgia Institute of Technology Recently, there has been significant interest in understanding the properties of Mar

Source URL: www2.isye.gatech.edu

A Selective Move Generator for the Game Axis and Allies David L. St-Pierre, Mark H.M. Winands and David A. Watt Abstract— We consider the move generation in a modern board game where the set of all the possible moves i

Source URL: game.itu.dk

• Game artificial intelligence
• Mathematics
• Game theory
• Gaming
• Computer chess
• Alphabeta pruning
• Minimax
• Monte Carlo tree search
• Outline of chess
• Go
• Dynasty Tactics

Vol 452 | 10 April 2008 | doi:nature06614 LETTERS Broad phylogenomic sampling improves resolution of the animal tree of life Casey W. Dunn1{, Andreas Hejnol1, David Q. Matus1, Kevin Pang1, William E. Browne1, St

Source URL: dunnlab.org

Abstracting Cryptographic Protocols with Tree Automata ? David Monniaux http://www.di.ens.fr/%7Fmonniaux, ´ Laboratoire d’Informatique, Ecole

Source URL: www-verimag.imag.fr

• Cryptography
• Public-key cryptography
• E-commerce
• Cryptographic protocols
• Internet Standards
• Computer security
• DolevYao model
• Cryptographic primitive
• Digital signature
• Communications protocol
• BurrowsAbadiNeedham logic
• XTR

Complexity of Data Tree Patterns over XML Documents Claire David LIAFA, University Paris 7 and CNRS, France

Source URL: www-igm.univ-mlv.fr

17 Extending Tree Models to Split Networks David Bryant 17.1 Introduction In this chapter we take statistical models designed for trees and adapt them for

Source URL: www.maths.otago.ac.nz

A Polynomial Time Algorithm for Constructing the Refined Buneman tree David Bryant CRM, Universit´e de Montr´eal, CP 6128 Succeursale Centre-ville, Montr´eal, Quebec H3C 3J7

Source URL: www.maths.otago.ac.nz

Tree Block Coordinate Descent for MAP in Graphical Models David Sontag Tommi Jaakkola Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology

Source URL: cs.nyu.edu

DIMACS Series in Discrete Mathematics and Theoretical Computer Science A Classification of Consensus Methods for Phylogenetics David Bryant Abstract. A consensus tree method takes a collection of phylogenetic trees

Source URL: www.maths.otago.ac.nz